Science Fiction and Macdonald's Polynomials

This work studies the remarkable relationships that hold among certain m-tuples of the Garsia-Haiman modules M and corresponding elements of the Macdonald basis. We recall that in 10], M is deened for a partition`n, as the linear span of derivatives of a certain bihomogeneouspolynomial (x; y) in the variables x 1 ; x 2 conjecturedin 6], 10] that M has n! dimensionsand that its bigraded Frobenius characteristicis given by the symmetricpolynomial e H (x; q; t) = P `n S (X) e K (q; t) where the e K (q; t) are related to the Macdonald q; t-Kostka coeecients K (q; t) by the identity e K (q; t) = K (q; 1=t)t n() with n() the x-degree of (x; y). Using this conjectured relation we can translate observed or proved properties of the modules M into identities for Macdonald polynomials. Computer data has suggested that as varies among the immediate predecessors of a partition , the spaces M behave like a boolean lattice. The same appears to holds true when varies among the immediate successors of. Combining this property with a number of observed facts and some \heuristics" we have been led to formulate a number of remarkable conjectures about the Macdonald polynomials. In particular we obtain a representationtheoretical interpretation for some of the symmetries that can be found in the computed tables of q; t-Kostka coeecients. The expression \Science Fiction" here refers to a package of \heuristics" that we use to describe relations amongst the modules M. These heuristics are purely speculative assertions that are used as a convenient guide to the construction of identities relating the corresponding bigraded Frobenius characteristics. Nevertheless computer experimentation reveals that these assertions are \generically" correct. Moreover, the evidence in support of the symmetric function identities we have derived from them are overwhelming. In particular, we show that various independent consequences of our heuristics lead to the same nal identities.